A Representation Theorem for Holonomic Sequences Based on Counting Lattice Paths

نویسندگان

  • Tomer Kotek
  • Johann A. Makowsky
چکیده

Using a theorem of N. Chomsky and M. Schützenberger one can characterize sequences of integers which satisfy linear recurrence relations with constant coefficients (C-finite sequences) as differences of two sequences counting words in regular languages. We prove an analog for P-recursive (holonomic) sequences in terms of counting certain lattice paths.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A representation theorem for (q-)holonomic sequences

Chomsky and Schützenberger showed in 1963 that the sequence dL(n), which counts the number of words of a given length n in a regular language L, satisfies a linear recurrence relation with constant coefficients for n, i.e., it is C-finite. It follows that every sequence s(n) which satisfies a linear recurrence relation with constant coefficients can be represented as dL1 (n)− dL2 (n) for two re...

متن کامل

representation theorems of $L-$subsets and $L-$families on complete residuated lattice

In this paper, our purpose is twofold. Firstly, the tensor andresiduum operations on $L-$nested systems are introduced under thecondition of complete residuated lattice. Then we show that$L-$nested systems form a complete residuated lattice, which isprecisely the classical isomorphic object of complete residuatedpower set lattice. Thus the new representation theorem of$L-$subsets on complete re...

متن کامل

ON THE SYSTEM OF LEVEL-ELEMENTS INDUCED BY AN L-SUBSET

This paper focuses on the relationship between an $L$-subset and the system of level-elements induced by it, where the underlying lattice $L$ is a complete residuated lattice and the domain set of $L$-subset is an $L$-partially ordered set $(X,P)$. Firstly, we obtain the sufficient and necessary condition that an $L$-subset is represented by its system of level-elements. Then, a new representat...

متن کامل

The Remak-Krull-Schmidt Theorem on\ Fuzzy Groups

In this paper we study a representation of a fuzzy subgroup $mu$ of a group $G$, as a product of indecomposable fuzzy subgroups called the components of $mu$.  This representation is unique up to the number of components and their isomorphic copies. In the crisp group theory, this is a well-known Theorem attributed to Remak, Krull, and Schmidt. We consider the lattice of fuzzy subgroups and som...

متن کامل

A Short Conceptual Proof of Narayana's Path-Counting Formula

We deduce Narayana’s formula for the number of lattice paths that fit in a Young diagram as a direct consequence of the Gessel-Viennot theorem on non-intersecting lattice paths.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Fundam. Inform.

دوره 117  شماره 

صفحات  -

تاریخ انتشار 2012